The Partition Algebra Revisited
نویسندگان
چکیده
منابع مشابه
The rook partition algebra
The rook partition algebra RPk(x) is a semisimple algebra for all but a finite number of values of x ∈ C that arises from looking at what commutes with the action of the symmetric group Sn on U ⊗k, where U is the direct sum of the natural representation and the trivial representation of Sn. We give a combinatorial description of this algebra, construct its irreducible representations, and exhib...
متن کاملThe Partition Function Revisited
In 1918, Hardy and Ramanujan wrote their landmark paper deriving the asymptotic formula for the partition function. The paper however was fundamental for another reason, namely for introducing the circle method in questions of additive number theory. Though this method is powerful, it is often difficult and technically complicated to employ. In 2011, Bruinier and Ono discovered a new algebraic ...
متن کاملq-Partition algebra combinatorics
We study a q-analog Qr(n, q) of the partition algebra Pr(n). The algebra Qr(n, q) arises as the centralizer algebra of the finite general linear group GLn(Fq) acting on a vector space IR q coming from r-iterations of Harish-Chandra restriction and induction. For n ≥ 2r, we show that Qr(n, q) has the same semisimple matrix structure as Pr(n). We compute the dimension dn,r(q) = dim(IR r q ) to be...
متن کاملParallel Partition Revisited
In this paper we consider parallel algorithms to partition an array with respect to a pivot. We focus on implementations for current widely available multi-core architectures. After reviewing existing algorithms, we propose a modification to obtain the minimal number of comparisons. We have implemented these algorithms and drawn an experimental comparison.
متن کاملMinimum Common String Partition Revisited
Minimum Common String Partition (MCSP) has drawn much attention due to its application in genome rearrangement. In this paper, we investigate three variants of MCSP: MCSP , which requires that there are at most c elements in the alphabet; d-MCSP, which requires the occurrence of each element to be bounded by d; and x-balanced MCSP, which requires the length of blocks being in range (n/k − x, n/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2000
ISSN: 0021-8693
DOI: 10.1006/jabr.2000.8365